Diophantine equations with sum of cubes and cube of sum

نویسندگان

چکیده

We solve Diophantine equations of the type $ \, a (x^3 + y^3 z^3 ) = (x y z)^3$, where $x,y,z$ are integer variables, and coefficient $a \neq 0$ is rational. show that there infinite families such equations, including those $a$ any ratio cubes or certain rational fractions, have nontrivial solutions. There also do not solution, $1/a 1 - 24/m$ with restrictions on $m$. The can be represented by elliptic curves unless 9$ 1. If an two variables equal nonzero, exist solutions only for $a=4$ 9; no 4$ when $xyz 0$. Without imposing constraints we find general solution 9$, which depends parameters. These cubic important in particle physics, because they determine fermion charges under $U(1)$ gauge group.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...

متن کامل

Dynamic Update Cube for Range-sum Queries

A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the selected cells of an OLAP data cube where target cells are decided by the specified query ranges. The direct method to access the data cube itself forces too many cells to be accessed, therefore it incurs a severe overhe...

متن کامل

Subset sum "cubes" and the complexity of primality testing

A Σ3 Boolean circuit has 3 levels of gates. The input level is comprised of OR gates each taking as inputs 2, not necessarily distinct, literals. Each of these OR’s feeds one or more AND gates at the second level. Their outputs form the inputs to a single OR gate at the output level. Using the projection technique of Paturi, Saks, and Zane, it is shown that the smallest Σ3 Boolean circuit testi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Number Theory and Physics

سال: 2022

ISSN: ['1931-4523', '1931-4531']

DOI: https://doi.org/10.4310/cntp.2022.v16.n2.a4